Multivalued Action Languages with Constraints in CLP(FD)
نویسندگان
چکیده
Action description languages, such as A and B [6], are expressive instruments introduced for formalizing planning domains and problems. The paper starts by proposing a methodology to encode an action language (with conditional effects and static causal laws), a slight variation of B, using Constraint Logic Programming over Finite Domains. The approach is then generalized to lift the use of constraints to the level of the action language itself. A prototype implementation has been developed, and the preliminary results are presented and discussed.
منابع مشابه
Programming with TOY(FD)
In [1] we presented the language T OY(FD) that integrates the best features of existing functional and logic languages, as well as finite domain (FD) constraint solving. We believe that T OY(FD) is more flexible and expressive than the existing approaches of constraint logic programming on finite domain (CLP (FD) ) as it integrates FD constraint solving, lazy evaluation, higher order applicatio...
متن کاملPlanning with Action Languages: Perspectives using CLP(FD) and ASP
Action description languages, such as A and B (Gelfond and Lifschitz, 1998), are expressive tools introduced for formalizing planning domains and problems. In this work, we investigate two alternative approaches to the problem of encoding action languages using logic programming. Starting from a slight variation of B, we explore the use of Answer Set Programming (ASP) and Constraint Logic Progr...
متن کاملTowards a glass-box typed CLP language
Constraint Logic Programming (CLP) merges two declarative paradigms: constraint solving and logic programming. This combination increases the efficiency of logical programming languages and, in some cases, makes programs more expressive than other kinds of programs. CLP has progressed in several quite different directions such as parallelism, concurrency, development of satisfiable algorithms i...
متن کاملEntailment of Finite Domain Constraints Entailment of Finite Domain Constraints
Using a glass-box theory of nite domain constraints, FD, we show how the entailment of user-deened constraints can be expressed by anti-monotone FD constraints. We also provide an algorithm for checking the entailment and consistency of FD constraints. FD is shown to be expressive enough to allow the deenition of arithmetical constraints, as well as non-trivial symbolic constraints, that are no...
متن کاملDesign,implementations,and Evaluation of the Constraint Language Cc(fd) Design, Implementation, and Evaluation of the Constraint Language Cc(fd)
This paper describes the design, implementation, and applications of the constraint logic language cc(FD). cc(FD) is a declarative nondeterministic constraint logic language over nite domains based on the cc framework 27], an extension of the CLP scheme 16]. Its constraint solver includes (non-linear) arithmetic constraints over natural numbers which are approximated using domain and interval c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- TPLP
دوره 10 شماره
صفحات -
تاریخ انتشار 2007